翻訳と辞書
Words near each other
・ Maximum coverage problem
・ Maximum cut
・ Maximum Darkness
・ Maximum demand indicator
・ Maximum density
・ Maximum Destruction
・ Maximum Diner
・ Maximum disjoint set
・ Maximum Downside Exposure (MDE)
・ Maximum Drive
・ Maximum elevation figure
・ Maximum engineering data rate
・ Maximum entropy
・ Maximum entropy probability distribution
・ Maximum entropy spectral estimation
Maximum entropy thermodynamics
・ Maximum Experimental Safe Gap
・ Maximum Exposure
・ Maximum Fantastic Four
・ Maximum Fighting Championship
・ Maximum Fighting Championship (2012) events
・ Maximum flow problem
・ Maximum Force
・ Maximum Fun
・ Maximum Games
・ Maximum Groove
・ Maximum harmonisation
・ Maximum Homerdrive
・ Maximum II
・ Maximum Illud


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Maximum entropy thermodynamics : ウィキペディア英語版
Maximum entropy thermodynamics
In physics, maximum entropy thermodynamics (colloquially, ''MaxEnt'' thermodynamics) views equilibrium thermodynamics and statistical mechanics as inference processes. More specifically, MaxEnt applies inference techniques rooted in Shannon information theory, Bayesian probability, and the principle of maximum entropy. These techniques are relevant to any situation requiring prediction from incomplete or insufficient data (e.g., image reconstruction, signal processing, spectral analysis, and inverse problems). MaxEnt thermodynamics began with two papers by Edwin T. Jaynes published in the 1957 ''Physical Review''.
== Maximum Shannon entropy ==
Central to the MaxEnt thesis is the principle of maximum entropy. It demands as given some partly specified model and some specified data related to the model. It selects a preferred probability distribution to represent the model. The given data state "testable information"〔Jaynes, E.T. (1968), p. 229.〕〔Jaynes, E.T. (1979), pp. 30, 31, 40.〕 about the probability distribution, for example particular expectation values, but are not in themselves sufficient to uniquely determine it. The principle states that one should prefer the distribution which maximizes the Shannon information entropy.
:S_I = - \sum p_i \ln p_i
This is known as the Gibbs algorithm, having been introduced by J. Willard Gibbs in 1878, to set up statistical ensembles to predict the properties of thermodynamic systems at equilibrium. It is the cornerstone of the statistical mechanical analysis of the thermodynamic properties of equilibrium systems (see partition function).
A direct connection is thus made between the equilibrium thermodynamic entropy ''S''Th, a state function of pressure, volume, temperature, etc., and the information entropy for the predicted distribution with maximum uncertainty conditioned only on the expectation values of those variables:
:S_(P,V,T,...)_ = k_B \, S_I(P,V,T,...)
''kB'', Boltzmann's constant, has no fundamental physical significance here, but is necessary to retain consistency with the previous historical definition of entropy by Clausius (1865) (see Boltzmann's constant).
However, the MaxEnt school argue that the MaxEnt approach is a general technique of statistical inference, with applications far beyond this. It can therefore also be used to predict a distribution for "trajectories" Γ "over a period of time" by maximising:
:S_I = - \sum p_ \ln p_
This "information entropy" does ''not'' necessarily have a simple correspondence with thermodynamic entropy. But it can be used to predict features of nonequilibrium thermodynamic systems as they evolve over time.
For non-equilibrium scenarios, in an approximation that assumes local thermodynamic equilibrium, with the maximum entropy approach, the Onsager reciprocal relations and the Green-Kubo relations fall out directly. The approach also creates a theoretical framework for the study of some very special cases of far-from-equilibrium scenarios, making the derivation of the entropy production fluctuation theorem straightforward. For non-equilibrium processes, as is so for macroscopic descriptions, a general definition of entropy for microscopic statistical mechanical accounts is also lacking.
''Technical note'': For the reasons discussed in the article differential entropy, the simple definition of Shannon entropy ceases to be directly applicable for random variables with continuous probability distribution functions. Instead the appropriate quantity to maximise is the "relative information entropy,"
:H_c=-\int p(x)\log\frac\,dx.
''Hc'' is the negative of the Kullback–Leibler divergence, or discrimination information, of ''m''(''x'') from ''p''(''x''), where ''m''(''x'') is a prior invariant measure for the variable(s). The relative entropy ''Hc'' is always less than zero, and can be thought of as (the negative of) the number of bits of uncertainty lost by fixing on ''p''(''x'') rather than ''m''(''x''). Unlike the Shannon entropy, the relative entropy ''Hc'' has the advantage of remaining finite and well-defined for continuous ''x'', and invariant under 1-to-1 coordinate transformations. The two expressions coincide for discrete probability distributions, if one can make the assumption that ''m''(''x''i) is uniform - i.e. the principle of equal a-priori probability, which underlies statistical thermodynamics.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Maximum entropy thermodynamics」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.